Flexible job shop scheduling using zero-suppressed binary decision diagrams
نویسندگان
چکیده
منابع مشابه
Chain Reduction for Binary and Zero-Suppressed Decision Diagrams
Chain reduction enables reduced ordered binary decision diagrams (BDDs) and zero-suppressed binary decision diagrams (ZDDs) to each take advantage of the others’ ability to symbolically represent Boolean functions in compact form. For any Boolean function, its chain-reduced ZDD (CZDD) representation will be no larger than its ZDD representation, and at most twice the size of its BDD representat...
متن کاملAn Introduction to Zero-Suppressed Binary Decision Diagrams
Zero-suppressed binary Decision Diagrams (ZDDs) have emerged as an efficient way of solving problems in set theory. This tutorial presents ZDDs and assumes that the reader is familiar with Boolean algebra and Binary Decision Diagrams, without prior knowledge of ZDDs. The case studies include the computation of the union of two sets, the generation of all primes of a Boolean function, and the co...
متن کاملFlexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملFlexible Job-Shop Scheduling Problems
Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Car...
متن کاملflexible job shop scheduling under availability constraints
in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Production Engineering & Management
سال: 2018
ISSN: 1854-6250,1855-6531
DOI: 10.14743/apem2018.4.297